MDP Periodically Time-Varying Convolutional Codes
نویسندگان
چکیده
In this paper we use some classical ideas from linear systems theory to analyse convolutional codes. In particular, we exploit input-state-output representations of periodic linear systems to study periodically time-varying convolutional codes. In this preliminary work we focus on the column distance of these codes and derive explicit necessary and sufficient conditions for an (n, 2, 1) periodically timevarying convolutional code to have Maximum Distance Profile (MDP).
منابع مشابه
Complete MDP convolutional codes
Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a certain length. Reverse MDP convolutional codes have the additional advantage that they are suitable for forward and backward decoding algorithms. Beyond th...
متن کاملA State Space Approach to Periodic Convolutional Codes
In this paper we study periodically time-varying convolutional codes by means of input-state-output representations. Using these representations we investigate under which conditions a given time-invariant convolutional code can be transformed into an equivalent periodic time-varying one. The relation between these two classes of convolutional codes is studied for period 2. We illustrate the id...
متن کاملConstructing strongly-MDS convolutional codes with maximum distance profile
This paper revisits strongly-MDS convolutional codes with maximum distance profile (MDP). These are (non-binary) convolutional codes that have an optimum sequence of column distances and attains the generalized Singleton bound at the earliest possible time frame. These properties make these convolutional codes applicable over the erasure channel, since they are able to correct a large number of...
متن کاملImproved error exponent for time-invariant and periodically time-variant convolutional codes
An improved upper bound on the error probability (first error event) of time-invariant convolutional codes, and the resulting error exponent, is derived in this paper. The improved error bound depends on both the delay of the code and its width (the number of symbols that enter the delay line in parallel) . Determining the error exponent of time-invariant convolutional codes is an open problem....
متن کاملOn superregular matrices and MDP convolutional codes
Superregular matrices are a type of lower triangular Toeplitz matrix that arises in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that the only submatrices having a zero determinant are those whose determinants are trivially zero due to the lower triangular structure. In this paper, we discuss how superregular...
متن کامل